Bounded Arithmetic, Cryptography and Complexity
نویسنده
چکیده
This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural proofs, interpolation theorems, connections to cryptography, and the difficulty of obtaining independence results.
منابع مشابه
Cuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملProofs, Programs and Abstract Complexity
Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being first order Peano arithmetic. Foundational questions asked about axiom systems comprise analysing their provable consequences, describing their class of provable recursive functions (i.e. for which programs can termination be proven from the axioms), and characterising their consistency strength. One b...
متن کاملAn exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin
Agrawal and Vinay [AV08] have recently shown that an exponential lower bound for depth four homogeneous circuits with bottom layer of × gates having sublinear fanin translates to an exponential lower bound for a general arithmetic circuit computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via homogeneous depth four circuits with boun...
متن کاملEnd Extensions of Models of Linearly Bounded Arithmetic
We show that every model of I 0 has an end extension to a model of a theory (extending Buss' S 0 2) where logspace computable function are formalizable. We also show the existence of an isomorphism between models of I 0 and models of linear arithmetic LA (i.e., second-order Presburger arithmetic with nite comprehension for bounded formulas). 0 Introduction. In the last two decades the research ...
متن کاملBounded Arithmetic, Proof Complexity and Two Papers of Parikh
This article surveys R. Parikh’s work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh’s papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997